Computational complexity

Results: 2253



#Item
41Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c

Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c

Add to Reading List

Source URL: somchaya.org

Language: English - Date: 2014-05-05 11:44:38
42Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡  Martin J. Straussk

Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2006-09-25 10:55:42
43A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:31:39
44MSGIC Executive Committee Meeting Minutes January 8, 2016 9a.m. – 12p.m. Anne Arundel County Government, Heritage Complex (Annapolis, MD)  Attendees:

MSGIC Executive Committee Meeting Minutes January 8, 2016 9a.m. – 12p.m. Anne Arundel County Government, Heritage Complex (Annapolis, MD) Attendees:

Add to Reading List

Source URL: msgic.org

Language: English - Date: 2016-04-09 16:41:29
45On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1  Institute of Theoretical Computer Science and Center of Advancing

On the Complexity of Universality for Partially Ordered NFAs∗ Markus Krötzsch1 , Tomáš Masopust2 , and Michaël Thomazo3 1 Institute of Theoretical Computer Science and Center of Advancing

Add to Reading List

Source URL: korrekt.org

Language: English - Date: 2016-06-13 07:14:39
46ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

Add to Reading List

Source URL: www.crypto.ethz.ch

Language: English - Date: 2015-02-25 05:09:48
47J Sci Educ Technol:127–147 DOIs10956Defining Computational Thinking for Mathematics and Science Classrooms David Weintrop1,2 • Elham Beheshti3 • Michael Horn1,2,3 • Kai Orton1,2

J Sci Educ Technol:127–147 DOIs10956Defining Computational Thinking for Mathematics and Science Classrooms David Weintrop1,2 • Elham Beheshti3 • Michael Horn1,2,3 • Kai Orton1,2

Add to Reading List

Source URL: ccl.northwestern.edu

Language: English - Date: 2016-05-03 12:24:06
48CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-01-06 16:13:01
49CHAPTER 8  Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI  8.1 INTRODUCTION

CHAPTER 8 Algorithms for Data Streams CAMIL DEMETRESCU and IRENE FINOCCHI 8.1 INTRODUCTION

Add to Reading List

Source URL: twiki.di.uniroma1.it

Language: English - Date: 2014-06-16 03:22:22
50Microsoft Word - orbs7180.doc

Microsoft Word - orbs7180.doc

Add to Reading List

Source URL: www.math.hkbu.edu.hk

Language: English - Date: 2013-09-27 05:04:48